منابع مشابه
Recycle of Random Sequences
The correlation between a random sequence and its transformed sequences is studied. In the case of a permutation operation or, in other word, the shuffling operation, it is shown that the correlation can be so small that the sequences can be regarded as independent random sequences. The applications to the Monte Carlo simulations are also given. This method is especially useful in the Ising Mon...
متن کاملHow to Recycle Random Bits
We show that modified versions of the linear congruential generator and the shift register generator are provably good for amplifying the correctness of a probabilistic algorithm. More precisely, if r random bits are needed for a BPP algorithm to be correct with probability at least 2/3, then O(r + k) bits are needed to improve this probability to 1 − 2−k. We also present a different pseudo-ran...
متن کاملFURTHER RESULTS OF CONVERGENCE OF UNCERTAIN RANDOM SEQUENCES
Convergence is an issue being widely concerned about. Thus, in this paper, we mainly put forward two types of concepts of convergence in mean and convergence in distribution for the sequence of uncertain random variables. Then some of theorems are proved to show the relations among the three convergence concepts that are convergence in mean, convergence in measure and convergence in distributio...
متن کاملNonrandom Sequences between Random Sequences
Let us say that an infinite binary sequence q lies above an infinite binary sequence p if q can be obtained from p by replacing selected 0’s in p by 1’s. We show that above any infinite binary Martin-Löf random sequence p there exists an infinite binary nonrandom sequence q above which there exists an infinite binary random sequence r. This result is of interest especially in connection with th...
متن کاملBinary Random Sequences Obtained From Decimal Sequences
D sequences [1-15] are perhaps the simplest family of random sequences that subsumes other families such as shift register sequences [16]. In their ordinary form, d sequences are not computationally complex [2], but they can be used in a recursive form [8] that is much stronger from a complexity point of view. The basic method of the generating the binary d-sequences is given in [1]. The autoco...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Modern Physics C
سال: 1993
ISSN: 0129-1831,1793-6586
DOI: 10.1142/s0129183193000562